Fast multipole methods on graphics processors
نویسندگان
چکیده
منابع مشابه
Fast multipole methods on graphics processors
The Fast Multipole Method allows the rapid evaluation of sums of radial basis functions centered at points distributed inside a computational domain at a large number of evaluation points to a specified accuracy . The method scales as O (N) in both time and memory compared to the direct method with complexity O(N), which allows the solution of larger problems with given resources. Graphical pro...
متن کاملNodal discontinuous Galerkin methods on graphics processors
Discontinuous Galerkin (DG) methods for the numerical solution of partial differential equations have enjoyed considerable success because they are both flexible and robust: They allow arbitrary unstructured geometries and easy control of accuracy without compromising simulation stability. Lately, another property of DG has been growing in importance: The majority of a DG operator is applied in...
متن کاملToward Fast Multipole Methods on a Lattice
We discuss the concept and implementation of fast multipole algorithms on a regular structured grid. In doing so, the discrte analogue of the continuous fundamental solution is evaluated numerically. We discuss the concept and implementation of fast multipole algorithms on a regular structured grid. In doing so, the discrte analogue of the continuous fundamental solution is evaluated numericall...
متن کاملA short course on fast multipole methods
In this series of lectures, we describe the analytic and computational foundations of fast multipole methods, as well as some of their applications. They are most easily understood, perhaps, in the case of particle simulations, where they reduce the cost of computing all pairwise interactions in a system of N particles from O(N) to O(N) or O(N logN) operations. They are equally useful, however,...
متن کاملIntroduction to Fast Multipole Methods
This is a simple introduction to fast multipole methods for the N-body summation problems. Low rank approximation plus hierarchical decomposition leads to fast O(N) or O(N logN) algorithms for the summation problem or equivalently the computation of a matrix-vector product. Code for 1-D problem is presented for a better illustration. We consider a summation problem in the form:
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2008
ISSN: 0021-9991
DOI: 10.1016/j.jcp.2008.05.023